Higher Dimensional Aztec Diamonds and a (2d + 2)-Vertex Model
نویسنده
چکیده
Motivated by the close relationship between the number of perfect matchings of the Aztec diamond graph introduced in [5] and the free energy of the square-ice model, we consider a higher dimensional analog of this phenomenon. For d ≥ 2, we construct d-uniform hypergraphs which generalize the Aztec diamonds and we consider a companion d-dimensional statistical model (called the 2d +2-vertex model) whose free energy is given by the logarithm of the number of perfect matchings of our hypergraphs. We prove that the limit defining the free energy per site of the 2d + 2-vertex model exists and we obtain bounds for it. As a consequence, we obtain an especially good asymptotical approximation for the number of matchings of our hypergraphs.
منابع مشابه
Symmetry classes of spanning trees of Aztec diamonds and perfect matchings of odd squares with a unit hole
We say that two graphs are similar if their adjacency matrices are similar matrices. We show that the square grid Gn of order n is similar to the disjoint union of two copies of the quartered Aztec diamond QADn−1 of order n− 1 with the path P (2) n on n vertices having edge weights equal to 2. Our proof is based on an explicit change of basis in the vector space on which the adjacency matrix ac...
متن کاملA generalization of Aztec diamond theorem, part II
We consider a new family of 4-vertex regions with zigzag boundary on the square lattice with diagonals drawn in. By proving that the number of tilings of the new regions is given by a power 2, we generalize both Aztec diamond theorem and Douglas’ theorem. The proof extends an idea of Eu and Fu for Aztec diamonds, by using a bijection between domino tilings and non-intersecting Schröder paths, t...
متن کاملAlternating-Sign Matrices and Domino Tilings (Part I)
We introduce a family of planar regions, called Aztec diamonds, and study tilings of these regions by dominoes. Our main result is that the Aztec diamond of order n has exactly 2()/ domino tilings. In this, the first half of a two-part paper, we give two proofs of this formula. The first proof exploits a connection between domino tilings and the alternating-sign matrices of Mills, Robbins, and ...
متن کاملEnumeration of Tilings of Quartered Aztec Rectangles
We generalize a theorem of W. Jockusch and J. Propp on quartered Aztec diamonds by enumerating the tilings of quartered Aztec rectangles. We use subgraph replacement method to transform the dual graph of a quartered Aztec rectangle to the dual graph of a quartered lozenge hexagon, and then use Lindström-GesselViennot methodology to find the number of tilings of a quartered lozenge hexagon.
متن کاملAztec diamonds and digraphs, and Hankel determinants of Schröder numbers
The Aztec diamond of order n is a certain configuration of 2n(n+1) unit squares. We give a new proof of the fact that the number Πn of tilings of the Aztec diamond of order n with dominoes equals 2. We determine a sign-nonsingular matrix of order n(n + 1) whose determinant gives Πn. We reduce the calculation of this determinant to that of a Hankel matrix of order n whose entries are large Schrö...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997